#include <bits/stdc++.h>

using namespace std;

class Solution {
public:
	vector<vector<int>> findContinuousSequence(int target) {
		vector<vector<int>> ans;
		vector<int> layer;
		for (int left = 1, right = 2; left < right;) {
			int sum = (left + right) * (right - left + 1) / 2;
			if (sum == target) {
				layer.clear();
				for (int i = left; i <= right; ++i)
					layer.emplace_back(i);

				ans.emplace_back(layer);
				left++;
				right++;
			} else if (sum < target) right++;
			else left++;
		}
		return ans;
	}
};

int main()
{
	return 0;
}
